管道中高次波的有源控制

探讨管道中高次波的有源控制问题.首先,对消声条件下的次级声源强度进行了理论分析,并对误差传声器的数目与位置进行了讨论.最后,进行了控制方截面管中(0,0)次波(平面波)和(1,0)次波的实验.结果表明,对管道中的高次波实施有源控制是完全可能的.     

f 壳层耦合态的完全分类与准旋标量算符本征值

本文用二次量子化方法,对l壳层引进准旋、自旋、轨道为(1/2,1/2,l)阶不可约张量的产生-湮灭算符b_(qsm)~(1/2 1/2 t),由4个这种算符按下式耦合成准旋、自旋、轨道标量算符, (?)Y (K_1,k_2,k_3) 与准旋、自旋、轨道算符对易,可用于对耦合态进一步分类。利用Y(k_1,k_2,k_3)与准旋、自旋、轨道算符的适当结合,本文给出了对f壳层完全分类的算符(组),给出了与G.Racah对f壳层分类一致的算符组。     

The joint signature of coherent systems

We investigate the joint signature of $m$ coherent systems, under the assumption that the components have independent and identically distributed lifetimes. The joint signature, for a particular ordering of failure times, is an $m$‐dimensional matrix depending solely on the composition of the systems and independent of the underlying distribution function of the component lifetimes. The elements of the $m$‐dimensional matrix are formulated based on the joint signatures of numerous series of parallel systems. The number of the joint signatures involved is an exponential function of the number of the minimal cut sets of each original system and may, therefore, be significantly large. We prove that although this number is typically large, a great number of the joint signatures are repeated, or removed by negative signs. We determine the maximum number of different joint signatures based on the number of systems and components. It is independent of the number of the minimal cut sets of each system and is polynomial in the number of components. Moreover, we consider all permutations of failure times and demonstrate that the results for one permutation can be of use for the others. Our theorems are applied to various examples. The main conclusion is that the joint signature can be computed much faster than expected.     

机场目标打击顺序灰色决策分析

对军事机场目标的结构、特征进行了系统分析,确立了军事机场目标评估体系,并运用灰色决策分析方法建立了军事机场多目标打击顺序确定的优化模型,为对该类实施导弹打击所进行的火力计划拟制提供了一种新的数学方法。     

一类广义L-统计量的极限分布

假定(X1,Y1),(X2,Y2),…,(Xn,Yn)是取自二维随机向量(X,Y)的独立同分布样本.记X(1)≤X(2)≤…≤X(n)是X1,X2,…,Xn产生的次序统计量,Y[1],Y[2],…,Y[n]是诱导的次序统计量.讨论广义L-统计量Tn=n-1 n∑i=1 J(i/n+1)Y[i]的极限分布,式中J(x)是由实际问题的需要而选取的权函数.在较弱的条件下,证明了Tn的渐近正态性,同时给出了Tn的期望和方差的渐近公式.     

基于饱和信息维的信息资源聚焦的数学模型

运用饱和信息维的增减技术对信息获取子空间进行结构上的剖分,将饱和信息维的"值"的获取分解为"白"与"灰"两部分,用饱和信息维列作为因子列来构造灰色关联空间,用关联序来描述信息之间的相关联程度,得到信息资源聚焦的一种新的数学模型。     

作战体系有序性判别模型*

未来作战已经逐步演变为体系之间的对抗,为确保我军作战体系有序进行发挥其作战力量,探讨了作战体系有序性问题;应用了耗散结构理论和灰色系统理论,把灰关联度与熵结合起来,以序参量为基础,建立了基于灰关联熵的作战体系有序性判别模型.研究结果为对作战体系实施调控提供了依据,使作战体系符合现代战场态势发展的需要.     

The one‐warehouse multiretailer problem with an order‐up‐to level inventory policy

We consider a two‐level system in which a warehouse manages the inventories of multiple retailers. Each retailer employs an order‐up‐to level inventory policy over T periods and faces an external demand which is dynamic and known. A retailer's inventory should be raised to its maximum limit when replenished. The problem is to jointly decide on replenishment times and quantities of warehouse and retailers so as to minimize the total costs in the system. Unlike the case in the single level lot‐sizing problem, we cannot assume that the initial inventory will be zero without loss of generality. We propose a strong mixed integer program formulation for the problem with zero and nonzero initial inventories at the warehouse. The strong formulation for the zero initial inventory case has only T binary variables and represents the convex hull of the feasible region of the problem when there is only one retailer. Computational results with a state‐of‐the art solver reveal that our formulations are very effective in solving large‐size instances to optimality. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010     

See the light: Optimization of put-to-light order picking systems

Put-to-light order picking systems invert the basic logic of conventional picker-to-parts systems. Instead of successively visiting the storage positions of the stock keeping units (SKUs) when collecting picking orders, an order picker accompanies successive bins each containing multiple items of a specific SKU along a lane of subsequent orders. Whenever the picker passes an order requiring the current SKU, which is indicated by a light signal, she puts the requested number of items into the bin associated with the order. Such an order picking system is well-suited if the assortment is not overly large and all orders demand similar SKUs, so that it is mainly applied in distribution centers of brick-and-mortar retail chains. This paper evaluates four different setups of put-to-light systems, which, during operations, require the solution of different storage assignment and SKU sequencing problems. We formulate these problems, prove computational complexity, and suggest suited solution algorithms. By applying these algorithms in a comprehensive computational study, we benchmark the impact of the four different setups on picking performance. In this way, warehouse managers receive decision support on how to set up their put-to-light systems.     

化学危险品事故处置的程序与技术要点

根据化学危险品事故的特点及消防部队的装备配备情况 ,提出了一整套化学危险品事故抢险救援的程序 ,并介绍了处置过程中的关键技术。